Formal Logic

نویسنده

  • Miguel Palomino
چکیده

where the universal (all) has been replaced with an existential (some/exists) then the argument would not be valid. In Ancient Greece, Aristotle exhaustively considered all possible combinations of universals and existentials in syllogisms, allowing also for the possibility of negations, and collected those corresponding to valid inferences in a classification theorem. For many centuries, that classification (slightly enhanced by the scholastics during the Middle Ages) was all there was to know about logic. In its origin, the term “formal” logic used to be a reference to the form of the arguments: the validity of an argument depends exclusively on the form of the premises and the conclusion, not on whether these are true or false. In the previous example, if we were to replace “horses” with “unicorns” the argument would still be valid, regardless of the fact that unicorns do no exist. Nowadays, however, “formal” refers to the use of the formal and rigorous methods of mathematics in the study of logic that began to be put into practice in the second half of the 19th century with George Boole and, especially, Gottlob Frege (see [1]). This trend started with a shift to a symbolic notation and artificial languages, and gradually evolved until, in 1933 with Tarski [2], it culminated with the withdrawal from an absolute notion of Truth and instead focused on the particular truths of concrete structures or models.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

?Logic and Formal Ontology: Is the Final Formal Ontology Possible

Musa Akrami AbstractMany philosophers and logicians have contemplated the relationship between ontology and logic. The author of this paper, working within a Bolzanoan-Husserlian tradition of studying both ontology and logic, considers ontology as the science of the most general features of beings and the most general relations among them. He considers logic as the science concernin...

متن کامل

Applications of Fuzzy Program Graph in Symbolic Checking of Fuzzy Flip-Flops

All practical digital circuits are usually a mixture of combinational and sequential logic. Flip–flops are essential to sequential logic therefore fuzzy flip–flops are considered to be among the most essential topics of fuzzy digital circuit. The concept of fuzzy digital circuit is among the most interesting applications of fuzzy sets and logic due to the fact that if there has to be an ultimat...

متن کامل

Equality propositional logic and its extensions

We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...

متن کامل

Explaining the Level of Human Thought in the Parallel Civilizations Based on Formal Structure and Visual Imagination Formed in Mythical Narratives

Myth, like any other form of narrative, has an undeniable role in visual imagination based on the foundations of mythical thought. Ernst Cassirer, by recovering the fundamental principles of mythical thought, brings against them to the foundations of contemporary rational thought and defines the fundamental features of mythical thought as compared to modern rational thought. He also believes t...

متن کامل

EQ-logics with delta connective

In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...

متن کامل

A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving

In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008